A diagonal PRP-type projection method for convex constrained nonlinear monotone equations

Iterative methods for nonlinear monotone equations do not require the differentiability assumption on residual function. This special property of makes them suitable solving large-scale nonsmooth equations. In this work, we present a diagonal Polak-Ribi\begin{document}$ \grave{e} $\end{document}re-Polyak (PRP) conjugate gradient-type method with convex constraints. The search direction is combine form multivariate (diagonal) spectral and modified PRP gradient method. Proper safeguards are devised to ensure positive definiteness matrix associated direction. Based Lipschitz continuity monotonicity assumptions shown be globally convergent. Numerical results presented by means comparative experiments recently proposed Dai-Yuan-type (J. Ind. Manag. Optim. 13 (2017) 283-295) Wei-Yao-Liu-type (Int. J. Comput. Math. 92 (2015) 2261-2272) methods.